Inner and outer approximation of convex sets using alignment
نویسندگان
چکیده
منابع مشابه
Inner and outer approximation of capture basin using interval analysis
This paper proposes a new approach to solve the problem of computing the capture basin C of a target T. The capture basin corresponds to the set of initial states such that the target is reached in finite time before possibly leaving of constrained set. We present an algorithm, based on interval analysis, able to characterize an inner and an outer approximation C− ⊂ C ⊂ C+ of the capture basin....
متن کاملInner-Outer Bracket Models for Word Alignment using Hidden Blocks
Most statistical translation systems are based on phrase translation pairs, or “blocks”, which are obtained mainly from word alignment. We use blocks to infer better word alignment and improved word alignment which, in turn, leads to better inference of blocks. We propose two new probabilistic models based on the innerouter segmentations and use EM algorithms for estimating the models’ paramete...
متن کاملAn Outer-Inner Approximation for separable MINLPs
A common structure in convex mixed-integer nonlinear programs is separable nonlinear functions. In the presence of such structures, we propose three improvements to the outer approximation algorithms. The first improvement is a simple extended formulation, the second is a refined outer approximation, and the third is a heuristic inner approximation of the feasible region. These methods have bee...
متن کاملQuadratic Outer Approximation for Convex Integer Programming
We present a quadratic outer approximation scheme for solving general convex integer programs, where suitable quadratic approximations are used to underestimate the objective function instead of classical linear approximations. As a resulting surrogate problem we consider the problem of minimizing a function given as the maximum of finitely many convex quadratic functions having the same Hessia...
متن کاملInterpolation and Approximation from Convex Sets
Let X be a topological vector space, Y = IR n , n 2 IN, A a continuous linear map from X to Y , C X, B a convex set dense in C, and d 2 Y a data point. We derive conditions which guarantee that the set B \ A ?1 (d) is nonempty and dense in C \ A ?1 (d). Some applications to shape preserving interpolation and approximation are described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2015
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-015-0941-0